package com.google.codejam;

import hu.mapro.jam.commons.Problem;

import java.util.Arrays;
import java.util.Scanner;

import com.google.common.base.Joiner;

/**
 *  Using <a href="http://code.google.com/p/maprohu-codejam-lib/">Google Code Jam library</a>. 
 */
public class SafetyInNumbers extends Problem {

	public SafetyInNumbers() {
		super("A", true);
	}

	@Override
	protected String solve(Scanner in) {
		int N = in.nextInt();
		
		double[] m = new double[N];
		
		double X = 0;
		
		for (int i=0 ; i < N ; i++) {
			m[i] = in.nextInt();
			
			X += m[i];
		}

		double W = 0;
		double JW = 0;
		
		for (int i=0 ; i < N ; i++) {
			double J = m[i];
			
			if (J > (2*X)/N) {
				W++;
				JW+=J;
			}
		}
		
		Double[] r = new Double[N];
		
		double L = N - W;
		
		for (int i=0 ; i < N ; i++) {
			double J = m[i];

			if (J > (2*X)/N) {
				r[i] = 0.0;
			} else {
				r[i] = ((((2*X - JW)/L)-J)/X) * 100.0;   
			}
		}
		
		return Joiner.on(" ").join(r);
	}

}
